MRHS Equation Systems that can be Solved in Polynomial Time
نویسندگان
چکیده
منابع مشابه
Mrhs Equation Systems That Can Be Solved in Polynomial Time
In this article we study the difficulty of solving Multiple Right-Hand Side (MRHS) equation systems. In the first part we show that, in general, solving MRHS systems is NP-hard. In the next part we focus on special (large) families of MRHS systems that can be solved in polynomial time with two algorithms: one based on linearisation of MRHS equations, and the second one based on decoding problem...
متن کاملTenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملCan a System of Linear Diophantine Equations be Solved in Strongly Polynomial Time?
We demonstrate that the answer to the question posed in the title is “yes” and “no”: “no” if the set of permissible operations is restricted to {+,−,×,/,mod,<}; “yes” if we are also allowed a gcd-oracle as a permissible operation. It has been shown (see [Sto76, MST91]) that no strongly polynomial algorithm exists for the problem of finding the greatest common divisor (gcd) of two arbitrary inte...
متن کاملIsomorphism, Automorphism Partitioning, and Canonical Labeling Can Be Solved in Polynomial-Time for Molecular Graphs
The graph isomorphism problem belongs to the class of NP problems, and has been conjectured intractable, although probably not NP-complete. However, in the context of chemistry, because molecules are a restricted class of graphs, the problem of graph isomorphism can be solved efficiently (i.e., in polynomial-time). This paper presents the theoretical results that for all molecules, the problems...
متن کاملComputational Problems that can be Solved Without Computation
The paper discusses various optimization problems that look fairly difficult at first sight, but in fact are trivial to solve. Here the word ‘trivial’ means that there exist primitive computer programs for these problems whose behavior hardly depends on the input data. Among the discussed problems are: Minimizing the failure probability in a cyclic double-loop system; the travelling salesman pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tatra Mountains Mathematical Publications
سال: 2016
ISSN: 1210-3195
DOI: 10.1515/tmmp-2016-0040